Optimization problems in system-level synthesis∗

System-level synthesis aims at partially automating the design and synthesis process of complex systems that consist of both hardware and software. This involves the usage of formal methods such as graph theory, as well as the formulation of some design steps explicitly as optimization problems. This paper describes such a graph-theoretic model, and presents three important optimization problems: scheduling, allocation, and partitioning. All of these turn out be NP-hard. However, some important sub-cases can be efficiently solved.